中英
1
shortest path first中文是什么意思
- 中文翻譯
- 造句
- 最短路徑優(yōu)先
- short adj. 1.短的；短暫的。 (opp. long)。 ...
- path n. (pl. paths ) 1.(自然踏成的)路；路 ...
- first adj. 1.最初的，最早的。 2.最上等的，第一流的。 ...
- open shortest path first 近路先開協(xié)議; 開放式最短路徑優(yōu)先; 開放最短路徑優(yōu)先; 先打開最短路徑
- open shortest path first (ospf) 開放最短路徑優(yōu)先（協(xié)議）
- ospf open shortest path first 開放式最短通路優(yōu)先（協(xié)議）; 開放最短路徑優(yōu)先路由協(xié)議
- shortest path first protocol spfp 最短路徑優(yōu)先協(xié)議
- mospf multicast open shortest path first 多播開放式最短路徑優(yōu)先
- open shortest path first（ospf）protocol 優(yōu)先開放最短路徑
- ospf multicast open shortest path first 組播
- shortest path 最短道路; 最短通路, 最短路徑
- distributed shortest path algorithm 分布式最短路徑算法; 分散式最短路徑演算法
- k shortest path 條最短路徑
- k shortest path method 最短路徑方法
- open shortest path firstprotocol 優(yōu)先開放最短路徑
- pair-shortest path 對偶最短通路
- rsreduced shortest path 簡約的最短通路
- shortest path algorithm 最短路徑算法; 最短路徑算則
- shortest path assignment 最短路徑分配
- shortest path horizontal 最短刀軌
- shortest path problem 圖論最短路; 最短道路問題; 最短路徑; 最短通路問題
- shortest path routing 最短路徑選擇; 最短途徑路由選擇
- shortest path tree 最短路徑樹
- shortest-path routing 最短路徑路由選擇
- sph shortest path heuristic 最短路徑推斷
- Open shortest path first other file
開放系統(tǒng)最短路徑優(yōu)先 - Dijkstra ' s shortest path first algorithm
最短路徑算法 - Open shortest path first protocol
優(yōu)先開放最短路徑 - Open shortest path first
開放最短路徑優(yōu)先協(xié)議 - Spf shortest path first
最短路徑優(yōu)先 - Ospf ( open shorted path first ) and is - is ( inter - domain system - inter - domain system ) , relating to routing ; and lmp , relating to link management
關(guān)于路由的ospf (開放最短路徑優(yōu)先)協(xié)議和is - is （域間系統(tǒng)?域間系統(tǒng)）協(xié)議； - Open shortest path first ( ospf ) is one of the routing protocol of internet . originally , it was developed to be the substitute for routing information protocol ( rip )
Ospf ( openshortestpathfirst ，開放最短路徑優(yōu)先)是internet路由選擇協(xié)議的一種，最初是為替代rip協(xié)議開發(fā)的，目前已成為構(gòu)建大型網(wǎng)絡(luò)最常用的路由選擇協(xié)議。 - Unfortunately , the problem of finding multicast routing with qos constrained is a np - complete problem . so we can not solve the problem with the classical shortest path first algorithms such as bellman - ford and dijstra
然而研究表明，由于qos組播路由帶有多個qos約束參數(shù)，因此qos組播路由問題是一個np完全問題，這使得它與傳統(tǒng)的路由過程不同，難以用經(jīng)典的最短路徑優(yōu)先算法求解。 - We presented an an model in this article . it based on the current structure of plan network , which use cost to instead of the hops to compute network path length and realize the route rule of shortest path first ( spf )
因此，在本文中提出了一個基于plan網(wǎng)絡(luò)的現(xiàn)有架構(gòu)，以開銷( cost )代替躍點(diǎn)( hops )計數(shù)計算網(wǎng)絡(luò)路徑長度，實現(xiàn)最短路徑優(yōu)先( shortestpathfirst ， spf )路由規(guī)則的主動網(wǎng)絡(luò)模型。 - This paper introduced the development of routing protocol , isolation technology , and then introduced the research scope of isolation technology around the world . and then analyzed the ospf ( open shortest path first ) protocol , introduced the routing hierarchy feature of it , analyzed the diffuse process , and the theory of how it works
本文介紹了路由協(xié)議、隔離技術(shù)的發(fā)展,并介紹了國內(nèi)外在隔離技術(shù)中的研究方向,接著分析了ospf路由協(xié)議,介紹了ospf分層路由的概念,詳細(xì)分析了ospf路由協(xié)議的擴(kuò)散過程和工作原理。
- 推薦英語閱讀
shortest path first的中文翻譯，shortest path first是什么意思，怎么用漢語翻譯shortest path first，shortest path first的中文意思，shortest path first的中文，shortest path first in Chinese，shortest path first的中文，shortest path first怎么讀，發(fā)音，例句，用法和解釋由查查在線詞典提供，版權(quán)所有違者必究。
關(guān)于我們
